A Coin Tossing Algorithm for Counting Large Numbers of Events
نویسنده
چکیده
"Approximate counters" are realized by probabilistic algorithms that maintain an approximate count in the interval 1 to n using only about 10921092 n bits. The algorithmic principle was proposed by R . M o r r i s [7] : Starting with counter C = 1, after n increments C should contain a good approximation to log e n . Thus C should be increased by 1 after other n increments approximately. Since only C is known the algorithm has to base its decision on the content of C alone . The principle to increment the counter is now
منابع مشابه
On impossibility of sequential algorithmic forecasting
The problem of prediction future event given an individual sequence of past events is considered. Predictions are given in form of real numbers pn which are computed by some algorithm φ using initial fragments ω1, . . . , ωn−1 of an individual binary sequence ω = ω1, ω2, . . . and can be interpreted as probabilities of the event ωn = 1 given this fragment. According to Dawid’s prequential frame...
متن کاملExperimental quantum tossing of a single coin
The cryptographic protocol of coin tossing consists of two parties, Alice and Bob, that do not trust each other, but want to generate a random bit. If the parties use a classical communication channel and have unlimited computational resources, one of them can always cheat perfectly. Here we analyze in detail how the performance of a quantum coin tossing experiment should be compared to classic...
متن کاملFinding a most biased coin with fewest flips
We study the problem of learning the most biased coin among a set of coins by tossing the coins adaptively. The goal is to minimize the number of tosses to identify a coin i∗ such that Pr (coin i∗ is most biased) is at least 1 − δ for any given δ. Under a particular probabilistic model, we give an optimal algorithm, i.e., an algorithm that minimizes the expected number of tosses, to learn a mos...
متن کاملCan Optimally-Fair Coin Tossing Be Based on One-Way Functions?
Coin tossing is a basic cryptographic task that allows two distrustful parties to obtain an unbiased random bit in a way that neither party can bias the output by deviating from the protocol or halting the execution. Cleve [STOC’86] showed that in any r round coin tossing protocol one of the parties can bias the output by Ω(1/r) through a “fail-stop” attack; namely, they simply execute the prot...
متن کاملideal quantum coin tossing are impossible.
There had been well known claims of “provably unbreakable” quantum protocols for bit commitment and coin tossing. However, we, and independently Mayers, showed that all proposed quantum bit commitment (and therefore coin tossing) schemes are, in principle, insecure because the sender, Alice, can always cheat successfully by using an EPR-type of attack and delaying her measurements. One might wo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003